#include <iostream>
#include <cstring>
#include <queue>

using namespace std;
typedef pair<int, int> PII;
const int N = 1010;

char a[N][N];
int dist[N][N];
int n, m;
int dx[] = { 0,0,-1,1 };
int dy[] = { 1,-1,0,0 };

void bfs()
{
	memset(dist, -1, sizeof dist);
	queue<PII> q;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
		{
			if(a[i][j] == '1') 
			{
				q.push({ i,j }); 
				dist[i][j] = 0;
			}
		}
	while (q.size())
	{
		auto t = q.front(); q.pop();
		int i = t.first, j = t.second;
		for (int k = 0; k < 4; k++)
		{
			int x = i + dx[k], y = j + dy[k];
			if (x >= 1 && x <= n && y >= 1 && y <= m && dist[x][y] == -1)
			{
				dist[x][y] = dist[i][j] + 1;
				q.push({ x,y });
			}
		}
	}

}

int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			cin >> a[i][j];
	
	bfs();

	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			cout << dist[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}